Improving the Numerical Robustness of Sphere Swept Collision Detection

نویسنده

  • Jeff Linahan
چکیده

This paper discusses improvements to the numerical robustness of the algorithm described in Kasper Fauerby’s “Improved Collision Detection and Response.” The algorithm addresses a common collision detection query: a moving sphere or ellipsoid vs. a set of motionless triangles. In its current form, the algorithm allows the sphere to penetrate the triangles. The sphere also displays “jittering” behavior when colliding with certain geometry. Most of these problems are the product of insufficient attention to numerical robustness, the focus of this paper. Motivated by the importance of numerical robustness in collision detection code, this paper addresses these problems in detail and proposes efficient solutions to them. Keywords—collision detection, sliding plane, round-off errors, robust algorithm

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Safe Swept Volume Method for Collision Detection Andre

This paper presents a collision detection method based on a swept volume approach. The proposed method computes a convex approximation (CSV) guaranteed to encompass the real swept volume (RSV). It is shown to be robust, which means that small errors in the model result in small errors in the result. It is first shown to be safe, which means that detections can ever be missed. It is then shown t...

متن کامل

A New Library for Real-time Continuous Collision Detection

We present the Kinematic Continuous Collision Detection Library (KCCD), a new library for real-time continuous collision detection for humanoid and industrial robots. The C++ library operates on joint state intervals. Such, it does not only test a single or N intermediate configurations but assures safety of a whole movement. The library uses sphere swept convex hulls (SSCH) as its volume repre...

متن کامل

Proximity Queries with Swept Sphere Volumes

We present novel algorithms for fast proximity queries using swept sphere volumes. The set of proximity queries includes collision detection and both exact and approximate separation distance computation. We introduce a new family of bounding volumes that correspond to a core primitive shape grown outward by some ooset. The set of core primitive shapes includes a point, line, and rectangle. Thi...

متن کامل

Fast Proximity Queries with Swept Sphere Volumes

We present novel algorithms for fast proximity queries using swept sphere volumes. The set of proximity queries includes collision detection and both exact and approximate separation distance computation. We introduce a new family of bounding volumes that correspond to a core primitive shape grown outward by some o set. The set of core primitive shapes includes a point, line, and rectangle. Thi...

متن کامل

C2A: Controlled conservative advancement for continuous collision detection of polygonal models

We present a simple and fast algorithm to perform continuous collision detection between polygonal models undergoing rigid motion for interactive applications. Our approach can handle all triangulated models and makes no assumption about the underlying geometry and topology. The algorithm uses the notion of conservative advancement (CA), originally developed for convex polytopes [1], [2]. We ex...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1211.0059  شماره 

صفحات  -

تاریخ انتشار 2012